On the Skeleton of Stonian p-Ortholattices

نویسندگان

  • Michael Winter
  • Torsten Hahmann
  • Michael Grüninger
چکیده

Boolean Contact Algebras (BCA) establish the algebraic counterpart of the mereotopolopy induced by the Region Connection Calculus. Similarly, Stonian p-ortholattices serve as a lattice theoretic version of the onthology RT− of Asher and Vieu. In this paper we study the relationship between BCAs and Stonian p-ortholattices. We show that the skeleton of every Stonian p-ortholattice is a BCA, and, conversely, that every BCA is isomorphic to the skeleton of a Stonian p-ortholattice. Furthermore, we prove the equivalence between algebraic conditions on Stonian p-ortholattices and the axioms C5, C6, and C7 for BCAs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the algebra of regular sets Properties of representable Stonian p-Ortholattices

The mereotopology RT− has in Stonian p-ortholattices its algebraic counterpart. We study representability of these lattices and show that not all Stonian p-ortholattices can be represented by the set of regular sets of a topological space. We identify five conditions that hold in algebras of regular sets and which can be used to eliminate non-representable Stonian p-ortholattices. This shows no...

متن کامل

Stonian p-ortholattices: A new approach to the mereotopology RT0

This paper gives a isomorphic representation of the subtheories RT−, RT− EC , and RT of Asher and Vieu’s first-order ontology of mereotopology RT0. It corrects and extends previous work on the representation of these mereotopologies. We develop the theory of p-ortholattices – lattices that are both orthocomplemented and pseudocomplemented – and show that the identity (x ·y)∗ = x∗+y∗ defines the...

متن کامل

A Note on Congruence Kernels in Ortholattices

We characterize ideals of ortholattices which are congruence kernels. We show that every congruence class determines a kernel.

متن کامل

Formalization of Ortholattices via Orthoposets

There are two approaches to lattices used in the Mizar Mathematical Library: on the one hand, these structures are based on the set with two binary operations (with an equational characterization as in [17]). On the other hand, we may look at them as at relational structures (posets – see [12]). As the main result of this article we can state that the Mizar formalization enables us to use both ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009